System and apparatus for the detection of randomness in three dimensional time series distributions made up of sparse data sets

ABSTRACT

A method and apparatus are provided for automatically characterizing the spatial arrangement among the data points of a three-dimensional time series distribution in a data processing system wherein the classification of said time series distribution is required. The method and apparatus utilize grids in Cartesian coordinates to determine (1) the number of cubes in the grids containing at least one input data point of the time series distribution; (2) the expected number of cubes which would contain at least one data point in a random distribution in said grids; and (3) an upper and lower probability of false alarm above and below said expected value utilizing a discrete binomial probability relationship in order to analyze the randomness characteristic of the input time series distribution. A labeling device also is provided to label the time series distribution as either random or nonrandom, and/or random or nonrandom within what probability, prior to its output from the invention to the remainder of the data processing system for further analysis.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application is related to U.S. Pat. No. 6,397,234, entitled SYSTEM AND APPARATUS FOR THE DETECTION OF RANDOMNESS IN TIME SERIES DISTRIBUTIONS MADE UP OF SPARSE DATA SETS, by the same inventors as this patent application.

STATEMENT OF GOVERNMENT INTEREST

The invention described herein may be manufactured and used by or for the Government of the United States of America for Governmental purposes without the payment of any royalties thereon or therefore.

BACKGROUND OF THE INVENTION

(1) Field of the Invention

The invention generally relates to signal processing/data processing systems for processing time series distributions containing a small number of data points (e.g., less than about ten (10) to fifteen (15) data points). More particularly, the invention relates to a method and apparatus for classifying the white noise degree (randomness) of a selected signal structure comprising a three dimensional time series distribution composed of a highly sparse data set. As used herein, the term “random”(or “randomness”) is defined in terms of a “random process” as measured by the probability distribution model used, namely a nearest-neighbor stochastic (Poisson) process. Thus, pure randomness, pragmatically speaking, is herein considered to be a time series distribution for which no function, mapping or relation can be constituted that provides meaningful insight into the underlying structure of the distribution, but which at the same time is not chaos.

(2) Description of the Prior Art

Recent research has revealed a critical need for highly sparse data set time distribution analysis methods and apparatus separate and apart from those adapted for treating large sample distributions. This is particularly the case in applications such as naval sonar systems, which require that input time series signal distributions be classified according to their structure, i.e., periodic, transient, random or chaotic. It is well known that large sample methods often fail when applied to small sample distributions, but that the same is not necessarily true for small sample methods applied to large data sets. Very small data set distributions may be defined as those with less than about ten (10) to fifteen (15) measurement (data) points. Such data sets can be analyzed mathematically with certain nonparametric discrete probability distributions, as opposed to large-sample methods, which normally employ continuous probability distributions (such as the Gaussian).

The probability theory discussed herein and utilized by the present invention is well known. It may be found, for example, in works such as P. J. Hoel et al., Introduction to the Theory of Probability, Houghton-Mifflin, Boston, Mass., 1971, which is hereby incorporated herein by reference.

Also, as will appear more fully below, it has been found to be important to treat white noise signals themselves as the time series signal distribution to be analyzed, and to identify the characteristics of that distribution separately. This aids in the detection and appropriate processing of received signals in numerous data acquisition contexts, not the least of which include naval sonar applications. Accordingly, it will be understood that prior analysis methods and apparatus analyze received time series data distributions from the point of view of attempting to find patterns or some other type of correlated data therein. Once such a pattern or correlation is located, the remainder of the distribution is simply discarded as being noise. It is believed that the present invention will be useful in enhancing the sensitivity of present analysis methods, as well as being useful on its own.

Previous U.S. Pat. No. 6,397,234 recited a method and apparatus for characterizing the spatial arrangement among the data points of a two dimensional time series distribution, e.g., sonar signal frequency over time. A large number of applications require processing three dimensional time series distributions, e.g., tracking the landing approach of an aircraft, missile tracking, or including a spatial dimension with the sonar distribution to assist in tracking a submarine. Thus, a need has been determined for providing a method and apparatus for characterizing the spatial arrangement among the data points of a three dimensional time series distribution.

SUMMARY OF THE INVENTION

Accordingly, it is an object of the invention to provide a method and apparatus including an automated measurement of the three dimensional spatial arrangement among a very small number of points, objects, measurements or the like whereby an ascertainment of the noise degree (i.e., randomness) of the time series distribution may be made.

It also is an object of the invention to provide a method and apparatus useful in naval sonar, radar and lidar and in aircraft and missile tracking systems, which require acquired signal distributions to be classified according to their structure (i.e., periodic, transient, random, or chaotic) in the processing and use of those acquired signal distributions as indications of how and from where they were originally generated.

Further, it is an object of the invention to provide a method and apparatus capable of labeling a three dimensional time series distribution with (1) an indication as to whether or not it is random in structure, and (2) an indication as to whether or not it is random within a probability of false alarm of a specific randomness calculation.

With the above and other objects in view, as will hereinafter more fully appear, a feature of the invention is the provision of a random process detection method and subsystem for use in a signal processing/data processing system. In a preferred embodiment, the random process (white noise) detection subsystem includes an input for receiving a three-dimensional time series distribution of data points expressed in Cartesian coordinates. This set of data points will be characterized by no more than a maximum number of points having values (amplitudes) between maximum and minimum values received within a preselected time interval. A hypothetical representation of a white noise time series signal distribution in Cartesian space is illustratively shown in FIG. 1. The invention is specifically adapted to analyze both selected portions of such time series distributions, and the entirety of the distribution depending upon the sensitivity of the randomness determination, which is required in any particular instance.

The input time series distribution of data points is received by a display/operating system adapted to accommodate a pre-selected number of data points N in a pre-selected time interval Δt and dispersed in three-dimensional space along with a first measure referred to as Y with magnitude ΔY=max(Y)−min(Y), and a second measure referred to as Z with magnitude ΔZ=max(Z)−min(Z). The display/operating system then creates a virtual volume around the input data distribution and divides the virtual volume into a grid consisting of cubic cells each of equal enclosed volume. Ideally, the cells fill the entire virtual volume, but if they do not, the unfilled portion of the virtual volume is disregarded in the randomness determination.

An analysis device then examines each cell to determine whether or not one or more of the data points of the input time series distribution are located therein. Thereafter, a counter calculates the number of occupied cells. Also, the number of cells which would be expected to be occupied in the grid for a totally random distribution is predicted by a computer device according to known Poisson probability process theory equations. In addition, the statistical bounds of the predicted value are calculated based upon known discrete binomial criteria.

A comparator is then used to determine whether or not the actual number of occupied cells in the input time series distribution is the same as the predicted number of cells for a random distribution. If it is, the input time series distribution is characterized as random. If it is not, the input time series distribution is characterized as nonrandom.

Thereafter, the characterized time series distribution is labeled as random or nonrandom, and/or as random or nonrandom within a pre-selected probability rate of the expected randomness value prior to being output back to the remainder of the data processing system. In the naval sonar signal processing context, this output either alone, or in combination with overlapping similarly characterized time series signal distributions, will be used to determine whether or not a particular group of signals is white noise. If that group of signals is white noise, it commonly will be deleted from further data processing. Hence, it is contemplated that the present invention, which is not distribution dependent in its analysis as most prior art methods of signal analysis are, will be useful as a filter or otherwise in conjunction with current data processing methods and equipment.

In the above regards, it should be understood that the statistical bounds of the predicted number of occupied cells in a random distribution (including cells occupied by mere chance) mentioned above may be determined by a second calculator device using a so-called probability of false alarm rate. In this case, the actual number of occupied cells is compared with the number of cells falling within the statistical boundaries of the predicted number of occupied cells for a random distribution in making the randomness determination. This alternative embodiment of the invention has been found to increase the probability of being correct in making a randomness determination for any particular time series distribution of data points by as much as 60%.

The above and other novel features and advantages of the invention, including various novel details of construction and combination of parts will now be more particularly described with reference to the accompanying drawings and pointed out by the claims. It will be understood that the particular device and method embodying the invention is shown and described herein by way of illustration only, and not as limitations on the invention. The principles and features of the invention may be employed in numerous embodiments without departing from the scope of the invention in its broadest aspects.

BRIEF DESCRIPTION OF THE DRAWINGS

Reference is made to the accompanying drawings in which is shown an illustrative embodiment of the apparatus and method of the invention, from which its novel features and advantages will be apparent to those skilled in the art, and wherein:

FIG. 1 is a hypothetical depiction in Cartesian coordinates of a representative white noise (random) time series signal distribution;

FIG. 2 is a hypothetical illustrative representation of a virtual volume in accordance with the invention divided into a grid of cubic cells each having a side of length δ, and an area of δ³;

FIG. 3 is a block diagram representatively illustrating the method steps of the invention;

FIG. 4 is a block diagram representatively illustrating an apparatus in accordance with the invention; and

FIG. 5 is a table showing an illustrative set of discrete binomial probabilities for the randomness of each possible number of occupied cells of a particular time series distribution within a specific probability of false alarm rate of the expected randomness number.

DESCRIPTION OF THE PREFERRED EMBODIMENT

Referring now to the drawings, a preferred embodiment of the method and apparatus of the invention will be presented first from a theoretical perspective, and thereafter, in terms of a specific example. In this regard, it is to be understood that all data points are herein assumed to be expressed and operated upon by the various apparatus components in a Cartesian coordinate system. Accordingly, all measurement, signal and other data input existing in terms of other coordinate systems is assumed to have been re-expressed in a Cartesian coordinate system prior to its input into the inventive apparatus or the application of the inventive method thereto.

The invention starts from the preset capability of a display/operating system 8 (FIG. 4) to accommodate a set number of data points N in a given time interval Δt. The data points are dispersed in three-dimensional space with a first measure referred to as Y with magnitude ΔY=max(Y)−min(Y), and a second measure referred to as Z with magnitude ΔZ=max(Z)−min(Z). A representation of a three-dimensional time series distribution of random data points 4 is shown in FIG. 1. A subset 4 a of this overall time series data distribution would normally be selected for analysis of its signal component distribution by this invention.

For purposes of mathematical analysis of the signal components, it is assumed that the product/quantity given by Δt*ΔY*ΔZ=[max(t)−min(t)]*[max Y−min(Y)]*[max(Z)−min(Z)] will define the virtual volume 4 b, illustrated as containing the subset 4 a, with respect to the quantities in the analysis subsystem. The sides of virtual volume are drawn parallel to the time axis and other axes as shown. Then, for substantially the total volume of the display region, a Cartesian partition is superimposed on the region with each partition being a small cube of sides 6 (see, FIG. 2). The measure of 6 will be defined herein as: $\begin{matrix} {\delta = \left( \frac{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}{k} \right)^{\frac{1}{3}}} & (1) \end{matrix}$

The quantity k represents the total number of small cubes of volume 63 created in the volume Δt*ΔY*ΔZ. Other than full cubes 6 are ignored in the analysis. The quantity of such cubes with which it is desired populate the display region is determined using the following relationship, wherein N is the maximum number of data points in the time series distribution, Δt, ΔY and ΔZ are the Cartesian axis lengths, and the side lengths of each of the cubes is δ: $\begin{matrix} {{k_{l} = {{{int}\left( \frac{\Delta \quad t}{\delta_{l}} \right)}*{{int}\left( \frac{\Delta \quad Y}{\delta_{l}} \right)}*{{int}\left( \frac{\Delta \quad Z}{\delta_{l}} \right)}}},} & (2) \end{matrix}$

where int is the integer operator, ${\delta_{l} = \sqrt[3]{\frac{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}{k_{0}}}},{and}$ $k_{0} = \left\{ \begin{matrix} {{k_{1}\quad {if}\quad {{N - k_{1}}}} \leq {{N - k_{2}}}} \\ {k_{2}\quad {otherwise}} \end{matrix} \right.$

where $\begin{matrix} {{k_{1} = \left\lbrack {{int}\quad \left( N^{\frac{1}{3}} \right)} \right\rbrack^{3}}{{k_{2} = \left\lbrack {{{int}\quad \left( N^{\frac{1}{3}} \right)} + 1} \right\rbrack^{3}};}\quad {k_{II} = {{{int}\left( \frac{\Delta \quad t}{\delta_{II}} \right)}*{{int}\left( \frac{\Delta \quad Y}{\delta_{II}} \right)}*{{int}\left( \frac{\Delta \quad Z}{\delta_{II}} \right)}}}} & (3) \end{matrix}$

where $\begin{matrix} {{\delta_{II} = \sqrt[3]{\frac{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}{N}}},{k = \left\{ \begin{matrix} {{k_{I}\quad {if}\quad K_{1}} > K_{II}} \\ {{k_{II}\quad {if}\quad K_{I}} < K_{II}} \\ {{{\max \left( {k_{I},k_{II}} \right)}\quad {if}\quad K_{I}} = K_{II}} \end{matrix} \right.}} & (4) \end{matrix}$

where $K_{I} = {{\frac{k_{I}}{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}\delta_{I}^{3}} \leq {1\quad {and}}}$ $K_{II} = {{\frac{k_{II}}{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}\delta_{II}^{3}} \leq 1.}$

It is to be noted that in cases with very small amplitudes, it may occur that int(ΔY/δ_(I))≦1, int(ΔY/δ_(II))≦1, int(ΔZ/δ_(I))≦1, or int(ΔZ/δ_(II))≦1. In such cases, the solution is to round off either quantity to the next highest value (i.e., ≧2). This weakens the theoretical approach, but it allows for practical measurements to be made.

As an example of determining k, assume Δt (or N)=30, ΔY=20 and ΔZ=9, then k=30 (from equations (2) through (4)) and δ=5.65 (from equation (1)). In essence, therefore, the above relation defining the value k selects the number of cubes having sides of length δ and volume δ³, which fill up the total space ΔT*ΔY*ΔZ to the greatest extent possible, i.e., k*δ³≈Δt*ΔY*ΔZ.

From the selected partitioning parameter k, the region (volume) Δt*ΔY*ΔZ is carved up into k cubes, with the sides of each cube being δ as defined above. In other words, the horizontal (or time) axis is marked off into intervals, exactly int(Δt/δ) of them, so that the time axis has the following arithmetic sequence of cuts (assuming that the time clock starts at Δt=0):

0, δ, 2δ, . . . , int(Δt/δ)*δ

Likewise, the vertical (or first measurement) axis is cut up into intervals, exactly int(ΔY/δ) of them, so that the vertical axis has the following arithmetic sequence of cuts:

min(Y), min(Y)+δ, . . . , min(Y)+int(ΔY/δ)*δ=max(Y),

where min is the minimum operator and max is the maximum operator.

Similarly, the horizontal plane (or second measurement) axis is cut up into intervals, exactly int(ΔZ/δ) of them, so that this horizontal plane axis has the following arithmetic sequence of cuts:

min(Z), min(Z)+δ, . . . , min(Z)+int(ΔZ/δ)*δ=max(Z).

Based on the Poisson point process theory for a measurement set of data in a time interval Δt of measurements of magnitudes ΔY and ΔZ, that data set is considered to be purely random (or “white noise”) if the number of partitions k are nonempty (i.e., contain at least one data point of the time series distribution thereof under analysis) to a specified degree. The expected number of nonempty partitions in a random distribution is given by the relationship:

 k*Θ=k*(1−e ^(−N/k))  (5)

where the quantity Θ is the expected proportion of nonempty partitions in a random distribution and N/k is “the parameter of the spatial Poisson process” corresponding to the average number of points observed across all three-dimensional subspace partitions.

The boundary, above and below k*Θ, attributable to random variation and controlled by a false alarm rate is the so-called “critical region” of the test. The quantity Θ not only represents (a) the expected proportion of nonempty cubic partitions in a random distribution, but also (b) the probability that one or more of the k cubic partitions is occupied by pure chance, as is well known to those in the art. The boundaries of the parameter k*Θ comprising random process are determined in the following way.

Let M be a random variable representing the integer number of occupied cubic partitions as illustratively shown in FIG. 2. Let m be an integer (sample) representation of M. Let m₁ be the quantity forming the lower random boundary of the statistic k*Θ given by the binomial criterion: ${{P\left( {M \leq m} \right)} \leq \frac{\alpha_{0}}{2}},{\min \left( {\frac{\alpha}{2} - \frac{\alpha_{0}}{2}} \right)}$

where, $\begin{matrix} {{P\left( {M \leq m} \right)} = {\sum\limits_{m = 0}^{m_{1}}{{B\left( {{m;k},\Theta} \right)}.}}} & (6) \end{matrix}$

B(m;k,Θ) is the binomial probability function given as: ${B\left( {{m;k},\Theta} \right)} = {\begin{pmatrix} k \\ m \end{pmatrix}(\Theta)^{m}\left( {1 - \Theta} \right)^{k - m}}$

where $\left( \left. \begin{matrix} k \\ m \end{matrix} \right) \right.$

is the binomial coefficient, $\begin{matrix} {{{\begin{pmatrix} k \\ m \end{pmatrix} = \frac{k!}{{m!}{\left( {k - m} \right)!}}},{and}}\quad} & \text{(6A)} \\ {{\sum\limits_{m = 0}^{m = k}{B\left( {{m;k},\Theta} \right)}} = {1.0.}} & \quad \end{matrix}$

The quantity α₀ is the probability of coming closest to an exact value of the pre-specified false alarm probability α, and m₁ is the largest value of m such that P(M≦m)≦α₀/2 . It is an objective of this method to minimize the difference between α and α₀. The recommended probability of false alarm (PFA) values for differing values of spatial subsets k, and based on commonly accepted levels of statistical precision, are as follows:

PFA (α) k 0.01 k ≧25 0.05 k <25

The upper boundary of the random process is called m₂, and is determined in a manner similar to the determination of m_(l).

Thus, let m₂ be the upper random boundary of the statistic k*Θ given by: ${{P\left( {M \geq m} \right)} \leq \frac{\alpha_{0}}{2}},{\min \left( {\frac{\alpha}{2} - \frac{\alpha_{0}}{2}} \right)}$

where $\begin{matrix} {{{P\left( {M \geq m} \right)} = {{\sum\limits_{m = m_{2}}^{k}{B\left( {{m;k},\Theta} \right)}} \leq {\alpha_{0}/2}}}\quad} & (7) \\ {{or}\quad} & \quad \\ {\quad {{P\left( {M \geq m} \right)} = {{1 - {\overset{m_{2} - 1}{\sum\limits_{m = 0}}{B\left( {{m;k},\Theta} \right)}}} \leq {\alpha_{0}/2.}}}} & \quad \end{matrix}$

The value α₀ is the probability coming closest to an exact value of the pre-specified false alarm probability α, and G is the largest value of m such that P(M≧m)≦α₀/2. It is an objective of the invention to minimize the difference between a and α₀.

Hence, the subsystem determines if the signal structure contains m points within the “critical region” warranting a determination of “non-random”, or else “random” is the determination, with associated PFA of being wrong in the decision when “random” is the decision.

The subsystem also assesses the random process hypothesis by testing:

H ₀ :{circumflex over (P)}=Θ(NOISE)

H ₁ :{circumflex over (P)}≠Θ(SIGNAL+NOISE)

where {circumflex over (P)}=m/k is the sample proportion of signal points contained in the k sub-region partitions of the space Δt*ΔY*ΔZ observed in a given time series. As noted above, FIG. 1 shows what a hypothetical white noise (random) distribution looks like in Cartesian time-space.

Thus, if Θ≈{circumflex over (P)}=m/k, the observed distribution conforms to a random distribution corresponding to “white noise”.

The estimate for the proportion of k cells occupied by N measurements ({circumflex over (P)}) is developed in the following manner. Let each of the k cubes with sides of length δ be denoted by C_(hij), and the number of objects observed in each C_(hij) cube be denoted card (C_(hij)) where card means “cardinality” or subset count. C_(hij) is labeled in an appropriate manner to identify each and every cube in the three space. Using the example given previously with N=Δt=30, ΔY=20, ΔZ=9 and k=30=5*3*2, the cubes may be labeled using the index h running from 1 to 5, the index i running from 1 to 3 and the index j running from 1 to 2 (see FIG. 2).

Next, to continue the example for k=30 shown in FIG. 2, define the following cube counting scoring scheme for the 5*3*2 partitioning comprising whole cube subsets: $X_{hij} = \left( {\begin{matrix} {{{{1\quad {if}\quad {{card}\left( C_{hij} \right)}} > 0};{h = {1\quad {to}\quad 5}}},{i = {1\quad {to}\quad 3}},{j = {1\quad {to}\quad 2}}} \\ {{{{0\quad {if}\quad {{card}\left( C_{hij} \right)}} = 0};{h = {1\quad {to}\quad 5}}},{i = {1\quad {to}\quad 3}},{j = {1\quad {to}\quad 2}}} \end{matrix}.} \right.$

Thus, X_(hij) is a dichotomous variable taking on the individual values of 1 if a cube C_(hij) has one or more objects present, and a value of 0 if the cube is empty.

Then calculate the proportion of 30 cells occupied in the partition region: $\hat{P} = {\frac{1}{30}{\sum\limits_{j = 1}^{2}{\sum\limits_{i = 1}^{3}{\sum\limits_{h = 1}^{5}{X_{hij}.}}}}}$

The generalization of this example to any sized table is obvious and within the scope of the present invention. For the general case, it will be appreciated that, for the statistics X_(hij) and C_(hij), the index h runs from 1 to int (Δt/δ), the index i runs from 1 to int(ΔY/δ) and the index j runs from 1 to int(ΔZ/δ).

In addition, another measure useful in the interpretation of outcomes is the R ratio, defined as the ratio of observed to expected occupancy rates: $\begin{matrix} {R = {\frac{m}{k*\Theta} = \frac{\hat{P}}{\Theta}}} & (8) \end{matrix}$

The range of values for R indicate:

R<1, clustered distribution

R=1, random distribution; and

R>1, uniform distribution.

The R statistic may be used in conjunction with the formulation just described involving the binomial probability distribution and false alarm rate in deciding to accept or reject the “white noise” hypothesis—or it may be used as the sole determinant. Its use is particularly warranted in very small samples (N<10). In actuality, R may never have a precise value of 1. Therefore, a recommended rule for determining randomness based on the R statistic of equation (8) is that data are considered random if:

R _(j−1) ≦R _(j) ≦R _(j+1),

where R_(j)=min(1−R_(i)).

1≦i≦k

To exemplify this rule, consider the data set of the previous example, i.e., N=Δt=30, ΔY=20, ΔZ=9 and k=30, resulting in the following:

m {circumflex over (p)} R_(m) COMMENT 1  1/30 0.05 2  2/30 0.11 3  3/30 0.16 4  4/30 0.21 5  5/30 0.26 6  6/30 0.32 7  7/30 0.37 8  8/30 0.42 9  9/30 0.47 10 10/30 0.53 11 11/30 0.58 12 12/30 0.63 13 13/30 0.69 14 14/30 0.74 15 15/30 0.79 16 16/30 0.84 17 17/30 0.90 18 18/30 0.95 R_(j−1) 19 19/30 1.00 R_(j) = 1.00 20 20/30 1.05 21 21/30 * *Data for R 22 22/30 * not shown 23 23/30 * 24 24/30 * 25 25/30 * 26 26/30 * 27 27/30 * 28 28/30 * 29 29/30 * 30 30/30 *

Thus, an R statistic between 0.95 and 1.05 is taken as a range of “randomness”, i.e., one value 6 from R≈1.00, corresponding to m between 18 and 20. An R value below or above these boundaries indicates “non-random”. In summary, operators may find the role of the R statistic to be more intuitively useful when very small sample sizes exist, for which no quantitative traditional method is useful in three-space.

EXAMPLE

Having thus explained the theory of the invention, an example thereof will now be presented for purposes of further illustration and understanding (see, FIGS. 3 and 4). A value for N is first selected, here N=30 (step 100, FIG. 3). A time series distribution of data points is then read into a display/operating subsystem δ adapted to accommodate a data set of size N from data processing system 10 (step 102). Thereafter, the absolute value of the difference between the largest and the smallest data points for each measure, ΔY and, is determined by a first comparator device 12 (step 104). In this example, it will be assumed that N=Δt=30 measurements with a measured amplitudes of ΔY=20 units and ΔZ=9 units. The N, ΔY and ΔZ values are then used by window creating device 14 to create a virtual volume in the display/operating system enclosing the input time series distribution, the size of the volume so created being Δt*ΔY*ΔZ=5400 units (step 106).

Thereafter, as described above, the virtual volume is divided by the cube creating device 14 into a plurality k of cubes C_(hij) (see FIG. 4), each cube having the same geometric shape and enclosing an equal volume so as to substantially fill the virtual volume containing the input time series distribution set of data points (step 108). The value of k is established by the relation given in equations (2) through (4): $k = {{{{int}\left( \frac{\Delta \quad t}{\delta} \right)}*{{int}\left( \frac{\Delta \quad Y}{\delta} \right)}*{{int}\left( \frac{\Delta \quad Z}{\delta} \right)}} = {{5*3*2} = 30}}$ $\delta = {\sqrt[3]{\frac{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}{k}} = {5.65.}}$

Thus, the 5400 unit³ space of the virtual volume is partitioned into 30 cubes of side 5.65 so that the whole space is filled (k*δ³=5400). The time-axis arithmetic sequence of cuts are: 0, 5.65, . . . , int(Δt/δ)*δ=28.2. The Y amplitude axis cuts are: min(Y), min(Y)+δ, . . . , min(Y)+int(ΔY/δ)*δ=max (Y) and the Z amplitude axis cuts are: min(Z), min(Z)+δ. . . , min(Z)+int (ΔZ/δ)*δ=max(Z)

Next, the probability false alarm rate is set at step 110 according to the value of k as discussed above. More particularly, in this case α=0.01, and the probability of a false alarm within the critical region is α/2=0.005.

The randomness count is then calculated by first computing device 16 at step 112 according to the relation of equation (5):

k*Θ=k*(1−e^(−N/k))=30*0.632≅19.

Therefore, the number of cubes expected to be non-empty in this example, if the input time series distribution is random, is about 19.

The binomial distribution discussed above is then calculated by a second computing device 18 according to the relationships discussed above (step 114, FIG. 3). Representative values for this distribution are shown in FIG. 5 for each number of possible occupied cells m for k=30 and Θ=0.632.

The upper and lower randomness boundaries then are determined, also by second calculating device 18. Specifically, the lower boundary is calculated from FIG. 5 (step 116) from the criterion P(M≦m)≦α₀/2 . Then, computing the binomial probabilities results in P(M≦11)=0.00265. Thus, the lower bound is m₁=11.

The upper boundary, on the other hand, is the randomness boundary m₂ from the criterion P(M≧m)≦α₀/2 . Computing the binomial probabilities gives P(M≧27)=0.00435; hence m₂₌₂₇ is taken as the upper bound (step 118). The probabilities necessary for this calculation also are shown in FIG. 5.

Therefore, the critical region is defined in this example as m₁≦11, and M₂≧27 (step 120).

The actual number of cells containing one or more data points of the time series distribution determined by analysis/counter device 20 (step 122, FIG. 3) is then used by divider 22 and a second comparator 24 in the determination of the randomness of the distribution (step 124, FIG. 3). Specifically, using m=18 as an example, it will be seen that the sample statistic {circumflex over (P)}=m/k=0.600, and that R={circumflex over (P)}/Θ=0.600/0.632=0.94. This value is close to the randomness boundary without consideration of the discrete binomial probability calculations discussed above. It is also worth noting in this regard that the total probability is 0.00265+0.00435=0.00700, which is the probability of being wrong in deciding “random”. This value is less than the probability of a false alarm, PFA=0.01. Thus, the actual protection against an incorrect decision is much higher (by about 30%) than the a priori sampling plan specified.

Since m=18 falls inside of the critical region, i.e., m₁≦18 ≦m₂, the decision is that the data represent an essentially white noise distribution (step 126). Accordingly, the distribution is labeled at step 128 by the labeling device 26 as a noise distribution, and transferred back to the data processing system 10 for further processing. In the naval sonar situation having a spatial component, a signal distribution labeled as white noise would be discarded by the processing system, but in some situations a further analysis of the white noise nature of the distribution would be possible. Similarly, the invention is contemplated to be useful as an improvement on systems that look for patterns and correlations among data points. For example, overlapping time series distributions might be analyzed in order to determine where a meaningful signal begins and ends.

It will be understood that many additional changes in the details, materials, steps and arrangement of parts, which have been herein described and illustrated in order to explain the nature of the invention, may be made by those skilled in the art within the principles and scope of the invention as expressed in the appended claims. 

What is claimed is:
 1. A method for characterizing a spatial arrangement among a pre-selected number N of data points of a three-dimensional time series distribution of pre-selected duration in a display/operating system wherein a classification of the spatial arrangement of said time series distribution is required, said method comprising the steps of: inputting said time series distribution of no more than N data points and no longer than said pre-selected time interval into said display/operating system; determining the difference in value of a first measure ΔY between the data point in said time series distribution having the greatest value of the first measure and the data point in said time series distribution having the smallest value of the first measure; determining the difference in value of a second measure ΔZ between the data point in said time series distribution having the greatest value of the second measure and the data point in said time series distribution having the smallest value of the second measure; creating a virtual volume having a geometric volume containing said time series distribution of data points, said geometric volume being equal to N*ΔY*ΔZ; subdividing substantially the entirety of said geometric volume of said virtual volume into a plurality k of cubes, each said cube having the same shape and defining the same volume value; determining a number m of said cells containing at least one of said data points of said time series distribution; determining an expected number M of cells containing at least one of said data points in said time series distribution in the event that said time series distribution is random in structure; and characterizing said input time series distribution as clustered in the event that m is less than M, random when m is equal to M, and uniform when m is greater than M.
 2. A method according to claim 1 wherein said time series distribution comprises less than about fifteen (15) data points.
 3. A method according to claim 1 wherein said display/operating system comprises a component of a naval sonar system.
 4. A method according to claim 1 wherein the characterizing step further comprises the steps of: determining statistical bounds of M based upon a probability of false alarm rate which is equal to 0.01 when k is greater than or equal to 25 and 0.05 when k is less than 25; and further characterizing said input time series distribution as random if m is within the statistical bounds of M.
 5. A method according to claim 4 wherein a discrete binomial probability distribution is used in determining said statistical bounds.
 6. A method for characterizing a spatial arrangement among data points of a subset of a three-dimensional time series distribution in a data processing system wherein a randomness classification of the time series distribution is required, said method comprising the steps of: inputting the time series distribution subset of data points, expressed in the form of Cartesian coordinates, into a display/operating system designed to accommodate the subset, the subset having a pre-selected number of data points N within a pre-selected time interval; measuring the difference between a maximum value of the data points of said distribution and a minimum value of the data points of said distribution for both a first measure and a second measure of the data; creating a virtual volume of a preselected geometric shape enclosing a geometric volume adapted to contain as many as said preselected number of data points N having a value between said maximum values and said minimum values of the data points for both the first and second measures of said input time series distribution; partitioning said virtual volume so as to create therein grids comprising a plurality k of cubes, each of said cubes having the same geometric shape and defining an equal volume, said grids substantially filling said virtual volume; selecting a probability of false alarm rate a equal to 0.01 when the total number of cubes is greater than or equal to 25 and 0.05 when the total number of cubes is less than 25; calculating the number of cubes in said grids expected to contain at least one of said input data points in a random distribution according to the relationship k*Θ=k*(1−e^(−N/k))  wherein N/k is the average number of data points located across all of the grids, and Θ is the expected proportion of cubes containing at least one data point in a random distribution; calculating the binomial distribution ${B\left( {{m;k},\Theta} \right)} = {\begin{pmatrix} k \\ m \end{pmatrix}(\Theta)^{m}\left( {1 - \Theta} \right)^{k - m}}$

where m is the number of cubes containing at least one of said data points and $\begin{pmatrix} k \\ m \end{pmatrix}$

is the binomial 1 coefficient, $\frac{k!}{{m!}{\left( {k - m} \right)!}};$

calculating the lower randomness boundary mof k*Θ using the values from the binomial distribution calculating step and the criterion: ${{P\left( {M \leq m} \right)} \leq \frac{\alpha_{0}}{2}},{\min \left( {\frac{\alpha}{2} - \frac{\alpha_{0}}{2}} \right)}$

where, ${{P\left( {M \leq m} \right)} = {\sum\limits_{m = 0}^{m_{1}}{B\left( {{m;k},\Theta} \right)}}},{{\sum\limits_{m = 0}^{k}{B\left( {{m;k},\Theta} \right)}} = 1},$

 M is the expected number of cubes containing at least one data point, and α₀ is the probability coming closest to an exact value of the pre-selected probability of false alarm rate α; calculating the upper randomness boundary m₂ of k*Θ in a manner similar to calculating m, using the criterion: ${{P\left( {M \geq m} \right)} \leq \frac{\alpha_{0}}{2}},{\min \left( {\frac{\alpha}{2} - \frac{\alpha_{0}}{2}} \right)}$

where, ${{P\left( {M \geq m} \right)} = {\overset{m = k}{\sum\limits_{m_{2}}}{B\left( {{m;k},\Theta} \right)}}};$

comparing the number of cubes in said grids containing at least one of said input data points with the range defined around k*Θ by m₁ and m₂; calculating the ratio of observed to expected cube occupancy rates according to the relation: ${R = \frac{m}{k*\Theta}};$

 determining said subset to be random when at least one condition of the number of cubes containing at least one of said input data points falls between m₁ and m2, and R having its value closest to 1, is satisfied; closing said virtual volume and selecting the next subset of the time data series for characterization when said subset is random; and transferring said subset to said data processing system for further analysis as non-white-noise prior to closing said virtual volume and selecting the next subset when said subset is nonrandom.
 7. The method according to claim 6 wherein k is determined from the relation $k = \left\{ {\begin{matrix} {{k_{I}\quad {if}\quad K_{1}} > K_{II}} \\ {{k_{II}\quad {if}\quad K_{I}} < K_{II}} \\ {{{\max \left( {k_{I},k_{II}} \right)}\quad {if}\quad K_{I}} = K_{II}} \end{matrix},{{{where}k_{I}} = {{{int}\left( \frac{\Delta \quad t}{\delta_{I}} \right)}*{{int}\left( \frac{\Delta \quad Y}{\delta_{I}} \right)}*{{int}\left( \frac{\Delta \quad Z}{\delta_{I}} \right)}}},{k_{II} = {{{int}\left( \frac{\Delta \quad t}{\delta_{II}} \right)}*{{int}\left( \frac{\Delta \quad Y}{\delta_{II}} \right)}*{{int}\left( \frac{\Delta \quad Z}{\delta_{II}} \right)}}},{\delta_{I} = \sqrt[3]{\frac{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}{k_{0}}}},{k_{0} = \left\{ {\begin{matrix} {{k_{1}\quad {if}\quad {{N - k_{1}}}} \leq {{N - k_{2}}}} \\ {k_{2}\quad {otherwise}} \end{matrix},{k_{1} = \left\lbrack {{int}\left( N^{\frac{1}{3}} \right)} \right\rbrack^{3}},{k_{2} = \left\lbrack {{{int}\left( N^{\frac{1}{3}} \right)} + 1} \right\rbrack^{3}},{\delta_{II} = \sqrt[3]{\frac{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}{N}}},{K_{I} = {{\frac{k_{I}}{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}\delta_{I}^{3}} \leq 1}},{K_{II} = {{\frac{k_{II}}{\Delta \quad t*\Delta \quad Y*\Delta \quad Z}\delta_{II}^{3}} \leq {1\quad {and}}}}} \right.}} \right.$

int is the integer operator.
 8. A method according to claim 7 wherein the respective values of int (ΔY/δ_(I)), int (ΔY/δ_(II)) , int (ΔZ/δ_(I)) and int (ΔZ/δ_(II)) are rounded off so as to be at least equal to 2 when a calculated value thereof is a maximum of
 1. 9. An apparatus for characterizing a spatial arrangement among data points of a three-dimensional time series distribution in a data processing system wherein a classification of said time series distribution is required, said apparatus comprising: a display/operating system adapted to accommodate a pre-selected number N of data points generated during a pre-selected time interval; a first comparator for determining the data points in said input time series distribution having the largest and the smallest values of a first measure and a second measure, and determining the difference ΔY between said largest and smallest values of said first measure of said data points and determining the difference ΔZ between said largest and smallest values of said second measure of said data points; a virtual volume creating device for creating a virtual volume having a geometric volume equal to N*ΔY*ΔZ containing said input time series distribution of data points, and subdividing substantially the entirety of said virtual volume into a plurality k of cubes, each said cube having the same geometric shape and defining an equal volume; a counter for determining the number m of said cubes containing at least one of said input data points of said input time series distribution; a calculator device for determining the expected number of said cubes which would be occupied by at least one of said data points in the event that said input time series distribution was random according to the relation k*(1−e^(−N/k)); a divider device for dividing m by k*(1−e^(−N/k)); a second comparator device for comparing the output of said divider with the number 1, and for characterizing said input time series distribution as random when the output of said divider is closest to 1, clustered when the output of said divider is less than the output closest to 1, and uniform when the output of said divider is greater than the output closest to 1; a marking device for associating the output of said second comparator with said input time series distribution; and an output device for transferring said marked input time series distribution to said data processing system for further processing.
 10. An apparatus according to claim 9 wherein said data processing system comprises a naval sonar system.
 11. An apparatus according to claim 9 further comprising a second calculator for determining statistical bounds of an expected number of cubes which would contain at least one of the data points of said input time series distribution in the event that said distribution was random, said calculator being programmed to calculate said statistical bounds based upon a probability of false alarm rate which is equal to 0.01 when k is greater than or equal to 25 and 0.05 when k is less than 25, said second comparator being also adapted to compare m with the statistical bounds calculated by said second calculator, said labeling device being also adapted to label the output of said second comparator as being within said statistical bounds and not within said statistical bounds. 